Remarks on space-time codes including a new lower bound and an improved code
نویسندگان
چکیده
This paper presents a new asymptotically exact lower bound on pairwise error probability of a space-time code as well as an example code that outperforms the comparable orthogonal-design-based space-time (ODST) code. Also contained in the paper are some observations relating to exact pairwise error probability, signal design guidelines and simplicity of the ODST code receiver. Keywords— Space-time codes, pairwise error probability, orthogonal design.
منابع مشابه
Estimates of the distance distribution of nonbinary codes, with applications
We use the polynomial method to derive upper and lower bounds on the distance distribution of nonbinary codes in the Hamming space. Applications of the bounds include a better asymptotic upper bound on the weight distribution of Goppa codes from maximal curves, a new upper bound on the size of a q-ary code with a given rth generalized weight, improved estimates of the size of secant spaces of a...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملSome Remarks on the Plotkin Bound
In coding theory, Plotkin’s upper bound on the maximal cadinality of a code with minimum distance at least d is well known. He presented it for binary codes where Hamming and Lee metric coincide. After a brief discussion of the generalization to q-ary codes preserved with the Hamming metric, the application of the Plotkin bound to q-ary codes preserved with the Lee metric due to Wyner and Graha...
متن کاملRemarks on low weight codewords of generalized affine and projective Reed-Muller codes
A brief survey on low weight codewords of generalized Reed-Muller codes and projective generalized Reed-Muller codes is presented. In the affine case some information about the words that reach the second distance is given. Moreover the second weight of the projective Reed-Muller codes is estimated, namely a lower bound and an upper bound of this weight are given.
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 49 شماره
صفحات -
تاریخ انتشار 2003